Katahdin A Programming Language Where the Syntax and Semantics Are Mutable at Runtime Chris Seaton Traditional Development Tools

Source URL: chrisseaton.com

• Software engineering
• Computing
• Computer programming
• Compiler construction
• Formal languages
• Procedural programming languages
• Programming language implementation
• Parsing algorithms
• Compiler-compiler
• Parsing
• Compiler
• Syntax

Electronic Notes in Theoretical Computer ScienceURL: http://www.elsevier.nl/locate/entcs/volume83.html 32 pages Secure Protocol Composition Anupam Datta 1 Ante Derek 1 John C. Mitchell 1 Computer Science Depar

Source URL: seclab.stanford.edu

• Logic
• Mathematics
• Abstraction
• Formal languages
• Mathematical logic
• Linear temporal logic
• Temporal logic
• Automated theorem proving
• Propositional calculus
• Substitution
• IP
• Interpretation

Semantics for core Concurrent ML using computation types Alan Jeffrey Abstract This paper presents two typed higher-order concurrent functional programming languages, based on Reppy’s Concurrent ML. The first is a simp

Source URL: ect.bell-labs.com

• Theoretical computer science
• Logic in computer science
• Software engineering
• Formal methods
• Programming language semantics
• Models of computation
• Operational semantics
• Semantics
• Bisimulation
• Process calculus
• Programming language
• Transition system

South Asian Languages: Formal Approaches and Computational Resources In conjunction with the 2011 Linguistic Summer Institute University of Colorado at Boulder Date: Sat) Time: 9:30am-6:00pm

Source URL: faculty.washington.edu

1 Monadic Parser Combinators Graham Hutton University of Nottingham

Source URL: www.cs.nott.ac.uk

• Software engineering
• Computer programming
• Parsing
• Functional programming
• Formal languages
• Compiler construction
• Parser combinator
• Monad
• Recursive descent parser
• Compiler-compiler
• Combinatory logic
• Syntax

CONTEXT–FREE LANGUAGES OF SUB–EXPONENTIAL GROWTH MARTIN R. BRIDSON AND ROBERT H. GILMAN Abstract. There do not exist context–free languages of intermediate growth. The function γ whose value at each non–negativ

Source URL: www.math.stevens.edu

• Formal languages
• Combinatorics on words
• Mathematics
• Theoretical computer science
• Model theory
• Academia
• Geometric group theory

The Why3 platform Version, May 2015 François Bobot1,2 Jean-Christophe Filliâtre1,2

Source URL: why3.lri.fr

• Proof assistants
• Functional languages
• Theoretical computer science
• Formal methods
• Logic in computer science
• Frama-C
• SPARK
• Coq
• Isabelle
• OCaml
• Formal verification
• French Institute for Research in Computer Science and Automation

On properties of logical sentences with arbitrary monadic predicates 1 Nathana¨el Fijalkow and Charles Paperman LIAFA Universit´ e Paris Diderot

Source URL: highlights-conference.org

• Formal languages
• FO
• Finite model theory
• Regular language
• Second-order logic
• Mathematical logic
• Linear temporal logic

Formal proofs and proof languages Enrico Tassi 23 June 2011 — Grenoble Roadmap

Source URL: sardes.inrialpes.fr

PDF Document

Source URL: www.math.stevens.edu

• Finite automata
• Formal languages
• Regular language
• Tree
• Theoretical computer science
• Mathematics
• Finite-state transducer
• Discrete mathematics
• Orbifold